Modification of Finite Automata Public Key Cryptosystem
نویسندگان
چکیده
Existing finite automata public key cryptosystems (FAPKC) are analyzed in this paper. General types of cryptanalytic attacks on FAPKC are discussed and methods of breaking FAPKC by some known types of attacks are introduced. The times needed to perform the usual cryptanalytic attacks on FAPKC are calculated, in order to estimate processing complexity of those attacks. The contrastive analysis of performed attacks’ processing complexities is made to compare the vulnerabilities of FAPKC against discussed attacks. As a result, an improved FAPKC is designed in order to resist the presented types of attacks. Strong FAPKC is obtained by generating invertible nonlinear and linear automata of the suitable form.
منابع مشابه
Break Finite Automata Public Key Cryptosystem
In this paper we break a 10-year's standing public key cryptosystem, Finite Automata Public Key Cryptosystem(FAPKC for short). The security of FAPKC was mainly based on the di culty of nding a special common left factor of two given matrix polynomials. We prove a simple but previously unknown property of the input-memory nite automata. By this property, we reduce the basis of the FAPKC's securi...
متن کاملQTRU: quaternionic version of the NTRU public-key cryptosystems
In this paper we will construct a lattice-based public-key cryptosystem using non-commutative quaternion algebra, and since its lattice does not fully fit within Circular and Convolutional Modular Lattice (CCML), we prove it is arguably more secure than the existing lattice-based cryptosystems such as NTRU. As in NTRU, the proposed public-key cryptosystem relies for its inherent securi...
متن کاملEEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations
GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...
متن کاملCellular Automaton Public-Key Cryptosystem
A public-key cryptosystem based on inhomogeneous cellu lar automata is prop osed . The running time of all known algorithms for br eaking t he system grows exponenti ally with the cipher block length.
متن کاملA Cryptosystem Based on the Composition of Reversible Cellular Automata
We present conditions which guarantee that a composition of marker cellular automata has the same neighbourhood as each of the individual components. We show that, under certain technical assumptions, a marker cellular automaton has a unique inverse with a given neighbourhood. We use these results to develop a working key generation algorithm for a public-key cryptosystem based on reversible ce...
متن کامل